Character correspondences in solvable groups
نویسندگان
چکیده
منابع مشابه
Character Sheaves on Neutrally Solvable Groups
Let G be an algebraic group over an algebraically closed field k of characteristic p > 0. In this paper we develop the theory of character sheaves on groups G such that their neutral connected components G◦ are solvable algebraic groups. For such algebraic groups G (which we call neutrally solvable) we will define the set CS(G) of character sheaves on G as certain special (isomorphism classes o...
متن کاملSolvable groups whose character degree graphs have non-trivial fundamental groups
In this talk, we introduce the character degree graph of a finite group G. We will discuss various properties of this graph, and we will further discuss what graphs can occur as the character degree graphs of finite solvable groups. In particular, we focus on groups with characters of degree pq, pr, and qr, where p, q, and r are distinct primes. Although some group theory will be assumed, knowl...
متن کاملON THE GLAUBERMAN AND WATANABE CORRESPONDENCES FOR BLOCKS OF FINITE p-SOLVABLE GROUPS
If G is a finite p-solvable group for some prime p, A a solvable subgroup of the automorphism group of G of order prime to |G| such that A stabilises a p-block b of G and acts trivially on a defect group P of b, then there is a Morita equivalence between the block b and its Watanabe correspondent w(b) of CG(A), given by a bimodule M with vertex ∆P and an endo-permutation module as source, which...
متن کاملCharacterization of Solvable Groups and Solvable radical
We give a survey of new characterizations of finite solvable groups and the solvable radical of an arbitrary finite group which were obtained over the past decade. We also discuss generalizations of these results to some classes of infinite groups and their analogues for Lie algebras. Some open problems are discussed as well.
متن کاملComputing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1982
ISSN: 0001-8708
DOI: 10.1016/0001-8708(82)90037-8